Non-commutative propositional logic with short-circuit evaluation

نویسندگان

چکیده

Short-circuit evaluation denotes the semantics of propositional connectives in which second argument is evaluated only if first insufficient to determine value expression. Compound statements are from left right. widely used programming, with negation and sequential conjunction disjunction as primitives. We study question laws axiomatise short-circuit evaluation. In MSCL (memorising logic), atoms (propositional variables) evaluate true or false, a compound statement, result each atom memorised. Hence, 'Non-commutative logic evaluation' atomic evaluations cannot cause side effect. Next, we consider case that can also truth 'undefined'. For two- three-valued MSCL, present trees an intuitive provide complete independent equational axiomatisations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Propositional Logic for Circuit Classes

By introducing a parallel extension rule that is aware of independence of the introduced extension variables, a calculus for quantified propositional logic is obtained where heights of derivations correspond to heights of appropriate circuits. Adding an uninterpreted predicate on bit-strings (analog to an oracle in relativised complexity classes) this statement can be made precise in the sense ...

متن کامل

Characterizing Propositional Proofs as Non-Commutative Formulas

Does every Boolean tautology have a short propositional-calculus proof? Here, a propositional-calculus (i.e., Frege) proof is any proof starting from a set of axioms and deriving new Boolean formulas using a fixed set of sound derivation rules. Establishing any superpolynomial size lower bound on Frege proofs (in terms of the size of the formula proved) is a major open problem in proof complexi...

متن کامل

Short-circuit logic

Short-circuit evaluation denotes the semantics of propositional connectives in which the second argument is evaluated only if the first argument does not suffice to determine the value of the expression. In programming, short-circuit evaluation is widely used. A short-circuit logic is a variant of propositional logic (PL) that can be defined by short-circuit evaluation and implies the set of co...

متن کامل

Satisfiability of Short Circuit Logic

The logical connectives typically found in programming languages are similar to their mathematical counterparts, yet different due to their short-circuit behaviour – when evaluating them, the second argument is only evaluated if the first argument is not sufficient to determine the result. Combined with the possibility of side-effects, this creates a different type of logic called Short Circuit...

متن کامل

Equality propositional logic and its extensions

We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Non-Classical Logics

سال: 2021

ISSN: ['1958-5780', '1166-3081']

DOI: https://doi.org/10.1080/11663081.2021.2010954